The b-chromatic index of direct product of graphs
نویسندگان
چکیده
منابع مشابه
The b-chromatic index of direct product of graphs
The b-chromatic index φ′(G) of a graph G is the largest integer k such that G admits a proper k-edge coloring in which every color class contains at least one edge incident to edges in every other color class. We give in this work bounds for the b-chromatic index of the direct product of graphs and provide general results for many direct products of regular graphs. In addition, we introduce a l...
متن کاملAcyclic chromatic index of Cartesian product of graphs
A proper edge colouring of a graph is said to be acyclic if every cycle of G receives at least three colors. The acyclic chromatic index, denoted , is the least number of colors required for an acyclic edge color of . This paper shows an upper bound of the acyclic chromatic index of a class of graphs which can be expressed as the Cartesian product of some graphs. We also give exact values for s...
متن کاملWiener Polarity Index of Tensor Product of Graphs
Mathematical chemistry is a branch of theoretical chemistry for discussion and prediction of the molecular structure using mathematical methods without necessarily referring to quantum mechanics. In theoretical chemistry, distance-based molecular structure descriptors are used for modeling physical, pharmacologic, biological and other properties of chemical compounds. The Wiener Polarity index ...
متن کاملThe locating chromatic number of the join of graphs
Let $f$ be a proper $k$-coloring of a connected graph $G$ and $Pi=(V_1,V_2,ldots,V_k)$ be an ordered partition of $V(G)$ into the resulting color classes. For a vertex $v$ of $G$, the color code of $v$ with respect to $Pi$ is defined to be the ordered $k$-tuple $c_{{}_Pi}(v)=(d(v,V_1),d(v,V_2),ldots,d(v,V_k))$, where $d(v,V_i)=min{d(v,x):~xin V_i}, 1leq ileq k$. If distinct...
متن کاملThe Strong Chromatic Index of Random Graphs
The strong chromatic index of a graph G, denoted by χs(G), is the minimum number of colors needed to color its edges so that each color class is an induced matching. In this paper we analyze the asymptotic behavior of this parameter in a random graph G(n, p), for two regions of the edge probability p = p(n). For the dense case, where p is a constant, 0 < p < 1, we prove that with high probabili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2015
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.04.003